#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

int n, m, q;
int f[N];
void init(int n) { rep(i, 1, n) f[i] = i; }
int find(int x) { return f[x] == x ? x : f[x] = find(f[x]); }
void merge(int x, int y) {
  int fx = find(x), fy = find(y);
  if (fx == fy) return;
  f[fy] = fx;
}
bool check(int x, int y) {
  int fx = find(x), fy = find(y);
  return fx == fy;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m >> q;
  init(n);
  while (m--) {
    int x, y;
    cin >> x >> y;
    merge(x, y);
  }
  while (q--) {
    int x, y;
    cin >> x >> y;
    if (check(x, y))
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
  }
  return 0;
}